Nomadic decompositions of bidirected complete graphs
نویسندگان
چکیده
منابع مشابه
Nomadic decompositions of bidirected complete graphs
We use K∗ n to denote the bidirected complete graph on n vertices. A nomadic Hamiltonian decomposition of K∗ n is a Hamiltonian decomposition, with the additional property that “nomads” walk along the Hamiltonian cycles (moving one vertex per time step) without colliding. A nomadic near-Hamiltonian decomposition is defined similarly, except that the cycles in the decomposition have length n − 1...
متن کاملCommuting Decompositions of Complete Graphs
We say that two graphs G and H with the same vertex set commute if their adjacency matrices commute. In this article, we show that for any natural number r, the complete multigraphK n is decomposable into commuting perfect matchings if and only if n is a 2-power. Also, it is shown that the complete graph Kn is decomposable into commuting Hamilton cycles if and only if n is a prime number. © 200...
متن کاملDecompositions of complete multipartite graphs
This paper answers a recent question of Dobson and Marušič by partitioning the edge set of a complete bipartite graph into two parts, both of which are edge sets of arctransitive graphs, one primitive and the other imprimitive. The first member of the infinite family is the one constructed by Dobson and Marušič.
متن کاملDecompositions of complete graphs into circulants
Let C(n;S) be a fixed circulant. The main problem is to determine the spectrum for values of v such that the complete graph Kv admits an edge-disjoint decomposition into subgraphs each of which is isomorphic to C(n;S). A complete solution in not to be expected since some instances correspond to famous existence problems (for instance, the existence of BIBD’s with λ = 1). On the other hand, the ...
متن کاملFair Hamilton Decompositions of Complete Multipartite Graphs
A fair hamilton decomposition of the complete multipartite graph G is a set of hamilton cycles in G whose edges partition the edges of G in such a way that, for each pair of parts and for each pair of hamilton cycles H1 and H2, the difference in the number of edges in H1 and H2 joining vertices in these two parts is at most one. In this paper we completely settle the existence of such decomposi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.07.023